Adversarial search is about exploring possible actions or movements between search-space states, when there is some other actor or effect that may be working independently of the search algorithm, or even aginst it. This is common in game playing, but stochastic or environmental effects have similar properties. In an adversarial search it is important to be able to mofel the range of possible moves that opponent(s) might make and predict their moves. The classic algorithm is minimax search where one attempts to find the best (maximum score) move assuming the worst possiible outcome (minimum score) taking into account your opponent's likely moves.
Used on pages 57, 80
Also known as adversarial